public class FindMinimumInRotatedSortedArray {
    // 寻找旋转排序数组中的最小值 https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/description/
    public int findMin(int[] nums) {
        int n=nums.length;
        int left=0,right=n-1;
        while(left<right) {
            int mid=left+(right-left)/2;
            if(nums[mid]>nums[n-1]) {
                left=mid+1;
            } else {
                right=mid;
            }
        }
        return nums[left];
    }
}
